Nonproper Products
نویسنده
چکیده
We show that there exist two proper creature forcings having a simple (Borel) definition, whose product is not proper. We also give a new condition ensuring properness of some forcings with norms.
منابع مشابه
Tate Conjecture and Mixed Perverse Sheaves
Using the theory of mixed perverse sheaves, we extend arguments on the Hodge conjecture initiated by Lefschetz and Griffiths to the case of the Tate conjecture, and show that the Tate conjecture for divisors is closely related to the de Rham conjecture for nonproper varieties, finiteness of the Tate-Shafarevich groups, and also to some conjectures in the analytic number theory. Dedicated to Joh...
متن کاملProper versus Nonproper - Global versus Local; Embedded Minimal Disks
Consider a sequence of (compact) embedded minimal disks Σi ⊂ BRi = BRi(0) ⊂ R 3 with ∂Σi ⊂ ∂BRi and either: (a) Ri equal to a finite constant. (b) Ri → ∞. We will refer to (a) as the local case and to (b) as the global case. Recall that a surface Σ ⊂ R is said to be properly embedded if it is embedded and the intersection of Σ with any compact subset of R is compact. We say that a lamination or...
متن کاملSome invariants of discrete-time descriptor systems
Many papers analyze the role of controllability and observability indices of normal linear systems in control theory and their use in the study of structural properties. This work introduces these indices for linear discrete-time descriptor systems. Such indices are studied in two different ways, by means of the state-space approach and using its transfer matrix . A canonical form of the state-...
متن کاملAverage-sense optimality and competitive optimality for almost instantaneous VF codes
One-shot coding and repeated coding are considered for the class of almost instantaneous variable-to-fixed length (AIVF) codes, AIVF, which includes some nonproper VF codes in addition to the class of proper VF codes, PVF. An algorithm is given to construct the average-sense optimal (a-optimal) AIVF code in one-shot coding that attains the maximum average parse length in AIVF. The algorithm can...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Generalized KYP Lemma: Unified Characterization of Frequency Domain Inequalities with Applications to System Design
The cerebrated Kalman-Yakubovic̆-Popov (KYP) lemma establishes the equivalence between a frequency domain inequality (FDI) and a linear matrix inequality (LMI), and has played one of the most fundamental roles in systems and control theory. This paper generalizes the KYP lemma in two aspects — the frequency range and the class of systems — and unifies various existing versions by a single theore...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009